Indistinguishable Proofs of Work or Knowledge
نویسندگان
چکیده
Foteini Baldimtsi is an Assistant Professor in the Computer Science Department at George Mason University. She received her Ph.D. from Brown University in May 2014 and worked as a postdoctoral researcher in Boston University and University of Athens. Her research interests are in the areas of cryptography, security and data privacy with a special focus in electronic payments, Bitcoin and blockchain technologies and private authentication techniques. During her PhD she was a recipient of a Paris Kanellakis fellowship and currently her research is supported by NSF, NSA and an IBM faculty award.
منابع مشابه
Efficient Non-interactive Proof Systems for Bilinear Groups
Noninteractive zero-knowledge proofs and noninteractive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this inefficiency is that noninteractive zero-knowledge proofs have been constructed for general NP-complete languages such as Circuit Satisfiability,...
متن کاملAdditive Proofs of Knowledge - A New Notion for Non-Interactive Proofs
This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identificatio...
متن کاملProofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
We give a generic methodology to unlinkably anonymize cryptographic schemes in bilinear groups using the Boneh-Goh-Nissim cryptosystem and nizk proofs in the line of Groth, Ostrovsky and Sahai. We illustrate our techniques by presenting the first instantiation of anonymous proxy signatures (in the standard model), a recent primitive unifying the functionalities and strong security notions of gr...
متن کاملWitness Indistinguishable Proofs and Constant Round Zero Knowledge
Blum’s Hamiltonicity protocol. We used Protocol 1.2 to prove this. We let HAM denote the NP-complete language of all Hamiltonian graphs (i.e., n vertex graphs that contain the n-cycle as a subgraph). Blum’s basic protocol for proving membership in HAM is Protocol 1.2. It is a 3-round public-coin proof for HAM with soundness error equal to 1 2 . Theorem 1.3 (Feige Shamir). If a protocol is zero-...
متن کاملGroth-Sahai Proofs Revisited
Since their introduction in 2008, the non-interactive zeroknowledge (NIZK) and non-interactive witness indistinguishable (NIWI) proofs designed by Groth and Sahai have been used in numerous applications. In this paper, we offer two contributions to the study of these proof systems. First, we identify and correct some errors, present in the oringal online manuscript, that occur in two of the thr...
متن کاملIsolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called `-isolated proofs of knowledge (`-IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to ` bits of communication with some external adversarial environment during the run of the proof. Without any additional setup assumptions, no witness hiding protocol can be an `-IPoK for unbounded values of `. However, for any pre-defined th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015